Fast Rectangular Matrix Multiplication and Applications
نویسندگان
چکیده
منابع مشابه
Fast Rectangular Matrix Multiplication and Applications
First we study asymptotically fast algorithms for rectangular matrix multiplication. We begin with new algorithms for multiplication of an n_n matrix by an n_n matrix in arithmetic time O(n), |=3.333953..., which is less by 0.041 than the previous record 3.375477... . Then we present fast multiplication algorithms for matrix pairs of arbitrary dimensions, estimate the asymptotic running time as...
متن کاملFast Matrix Multiplication
We give an overview of the history of fast algorithms for matrix multiplication. Along the way, we look at some other fundamental problems in algebraic complexity like polynomial evaluation. This exposition is self-contained. To make it accessible to a broad audience, we only assume a minimal mathematical background: basic linear algebra, familiarity with polynomials in several variables over r...
متن کاملPlethysm and fast matrix multiplication
Motivated by the symmetric version of matrix multiplication we study the plethysm $S^k(\mathfrak{sl}_n)$ of the adjoint representation $\mathfrak{sl}_n$ of the Lie group $SL_n$. In particular, we describe the decomposition of this representation into irreducible components for $k=3$, and find highest weight vectors for all irreducible components. Relations to fast matrix multiplication, in part...
متن کاملFast multiplication and its applications
This survey explains how some useful arithmetic operations can be sped up from quadratic time to essentially linear time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1998
ISSN: 0885-064X
DOI: 10.1006/jcom.1998.0476